Truly Concurrent Constraint Programming

نویسندگان

  • Vineet Gupta
  • Radha Jagadeesan
  • Vijay A. Saraswat
چکیده

We study “causality” relationships in Concurrent Constraint Programming: what is observed is not just the conjunction of constraints deposited in the store, but also the causal dependencies between these constraints. We describe a denotational semantics for cc that is fully-abstract with respect to observing this “causality” relation on constraints. This semantics preserves more fine-grained structure of computation; in particular the Interleaving Law

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Partial Order and SOS Semantics for Linear Constraint Programs

In this paper we consider linear constraint programming (lcp), a non-monotonic extension of concurrent constraint programming (ccp) which allows to remove information. The entailment relation of a linear constraint system, in terms of which linear constraint programs are deened, is based on the main underlying idea of linear logic: hypotheses in a logical derivation represent physical resources...

متن کامل

The Language Model LMNtal

LMNtal is a simple language model based on the rewriting of hierarchical graphs that use logical variables to represent links. The two major goals of the model are (i) to unify various computational models featuring multisets and (ii) to serve as the basis of a truly general-purpose language covering various platforms ranging from wide-area to embedded computation. Another contribution of the m...

متن کامل

De nitional Concurrent Constraint Programming

In this paper, deenitional constraint constraint programming, abbreviated as CDC, is presented as a uniform framework for declarative concurrent programming. The new paradigm supports a uniform concurrent computational model unifying functional evaluation, linear deduction and constraint solving. It leads us from a constraint based integration of functional and logic programming to a powerful f...

متن کامل

Constraint Based Languages for Biological Reactions

In this paper,we study themodelization of biochemical reaction by using concurrent constraint programming idioms. In particular we will consider the stochastic concurrent constraint programming(sCCP), the Hybrid concurrent constraint programming languages (Hcc) and the Biochemical Abstract Machines (BIOCHAM).

متن کامل

Object - Oriented Concurrent Constraint Programming

1.1 Abstract Oz is a higher-order concurrent constraint programming system under development at DFKI. It combines ideas from logic and concurrent programming in a simple yet expressive language. From logic programming Oz inherits logic variables and logic data structures, which provide for a programming style where partial information about the values of variables is imposed concurrently and in...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996